On counts of Bernoulli strings and connections to rank orders and random permutations

نویسندگان

  • Jayaram Sethuraman
  • Sunder Sethuraman
چکیده

A sequence of independent random variables {X1, X2, . . .} is called a B−harmonic Bernoulli sequence if P (Xi = 1) = 1 − P (Xi = 0) = 1/(i + B) i = 1, 2, . . ., with B ≥ 0. For k ≥ 1, the count variable Zk is the number of occurrences of the k-string (1, 0, . . . , 0 } {{ } k−1 , 1) in the Bernoulli sequence.. This paper gives the joint distribution PB of the count vector Z = (Z1, Z2, . . .) of strings of all lengths in a B−harmonic Bernoulli sequence. This distribution can be described as follows. There is random variable V with a Beta(B, 1) distribution, and given V = v, the conditional distribution of Z is that of independent Poissons with intensities (1− v), (1− v2)/2, (1− v3)/3, . . .. Around 1996, Persi Diaconis stated and proved that when B = 0, the distribution of Z1 is Poisson with intensity 1. Emery gave an alternative proof a few months later. For the case B = 0, it was also recognized that Z1, Z2, . . . , Zn are independent Poissons with intensities 1, 12 , . . . , 1 n . Proofs up until this time made use of hard combinational techniques. A few years later, Joffe et al, obtained the marginal distribution of Z1 as a Beta-Poisson mixture when B ≥ 0. Their proof recognizes an underlying inhomogeneous Markov chain and uses moment generating functions. In this note, we give a compact expression for the joint factorial moment of (Z1, . . . , ZN ) which leads to the joint distribution given above. One might feel that if Z1 is large, it will exhaust the number of 1’s in the Bernoulli sequence (X1, X2, . . .) and this in turn would favor smaller values for Z2 and introduce some negative dependence. We show that, on the contrary, the joint distribution of Z is positively associated or possesses the FKG property.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Connections between Bernoulli Strings and Random Permutations

A sequence of random variables, each taking only two values ”0” or ”1”, is called a Bernoulli sequence. Consider the counts of occurrences of strings of the form {11}, {101}, {1001}, . . . in Bernoulli sequences. Counts of such Bernoulli strings arise in the study of the cycle structure of random permutations, Bayesian nonparametrics, record values etc. The joint distribution of such counts is ...

متن کامل

Counts of Failure Strings in Certain Bernoulli Sequences

In a sequence of independent Bernoulli trials the probability for success in the k:th trial is pk, k = 1, 2, . . . . The number of strings with given number of failures between two subsequent successes is studied. Explicit expressions for distributions and moments are obtained for pk = a/(a + b + k − 1), a > 0, b ≥ 0. Also the limit behaviour of the longest failure string in the first n trials ...

متن کامل

A Study of Counts of Bernoulli Strings via Conditional Poisson Processes

A sequence of random variables, each taking values 0 or 1, is called a Bernoulli sequence. We say that a string of length d occurs in a Bernoulli sequence if a success is followed by exactly (d − 1) failures before the next success. The counts of such d-strings are of interest, and in specific independent Bernoulli sequences are known to correspond to asymptotic d-cycle counts in random permuta...

متن کامل

A Novel Intrusion Detection Systems based on Genetic Algorithms-suggested Features by the Means of Different Permutations of Labels’ Orders

Intrusion detection systems (IDS) by exploiting Machine learning techniques are able to diagnose attack traffics behaviors. Because of relatively large numbers of features in IDS standard benchmark dataset, like KDD CUP 99 and NSL_KDD, features selection methods play an important role. Optimization algorithms like Genetic algorithms (GA) are capable of finding near-optimum combination of the fe...

متن کامل

A Note on Embedding Certain Bernoulli Sequences in Marked Poisson Processes

A sequence of independent Bernoulli random variables with success probabilities a/(a+ b + k − 1), k = 1, 2, 3, . . . , is embedded in a marked Poisson process with intensity 1. Using this, conditional Poisson limits follow for counts of failure strings.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006